polygons. J. Algorithms, 6(2):213–224, 1985.
نویسنده
چکیده
[2] B. Bhattacharya and R. Benkoczi. On computing the optimal bridge between two convex polygons. [7] H. Edelsbrunner. Computing the extreme distances between two convex polygons. Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons.
منابع مشابه
Geometric Proportional Analogies In Topographic Maps: Theory and Application
This paper details the application of geometric proportional analogies in the sub-classification of polygons within a topographic (land cover) map. The first part of this paper concerns geometric proportional analogies that include attributes (fill-pattern and fillcolour). We describe an extension to the standard theory of analogy that incorporates attributes into the analogical mapping process...
متن کاملTemporally coherent conservative visibility
EEciently identifying polygons that are visible from a changing synthetic viewpoint is an important problem in computer graphics. Even with hardware support, simple algorithms like depth-buuering cannot achieve interactive frame rates when applied to geometric models with many polygons. However, a visibility algorithm that exploits the occlu-sion properties of the scene to identify a superset o...
متن کامل4. Concluding Remarks
A new linear algorithm for intersecting convex polygons. Comput. An optimal algorithm for computing the minimum vertex distance between two crossing convex polygons. Computing 32:357-364 13. Toussaint GT, Avis D (1982) On a convex hull algorithm for polygons and its application to triangulation problems. A new O(n log n) algorithm for computing the intersection of convex polygons. Pattern Recog...
متن کاملA New Heuristic Algorithm for Drawing Binary Trees within Arbitrary Polygons Based on Center of Gravity
Graphs have enormous usage in software engineering, network and electrical engineering. In fact graphs drawing is a geometrically representation of information. Among graphs, trees are concentrated because of their ability in hierarchical extension as well as processing VLSI circuit. Many algorithms have been proposed for drawing binary trees within polygons. However these algorithms generate b...
متن کاملIntramuscular Sarcocystis in two beluga whales and an Atlantic white-sided dolphin from the St. Lawrence estuary, Quebec, Canada.
2. Dubey JP: 1988, Lesions in sheep inoculated with Sarcocystis tenella sporocysts from canine feces. Vet Parasitol 26:237-252. 3. Dubey JP, Lindsay DS, Speer CA, et al.: 1988, Sarcocystis arieticanis and other Sarcocystis species in sheep in the United States. J Parasitol 74: 1033-1038. 4. Dubey JP, Speer CA, Callis G, Blixt JA: 1982, Development of the sheep-canid cycle of Sarcocystis tenella...
متن کامل